Adaptative Cubical Grid for Isosurface Extraction
نویسندگان
چکیده
This work proposes a variation on the Marching Cubes algorithm, where the goal is to represent implicit functions with higher resolution and better graphical quality using the same grid size. The proposed algorithm displaces the vertices of the cubes iteratively until the stop condition is achieved. After each iteration, the difference between the implicit and the explicit representations are reduced, and when the algorithm finishes, the implicit surface representation using the modified cubical grid is more detailed, as the results shall confirm. The proposed algorithm corrects some topological problems that may appear in the discretisation process using
منابع مشابه
Direct Isosurface Extraction from Scattered Volume Data
Isosurface extraction is a standard visualization method for scalar volume data and has been subject to research for decades. Nevertheless, to our knowledge, no isosurface extraction method exists that directly extracts surfaces from scattered volume data without 3D mesh generation or reconstruction over a structured grid. We propose a method based on spatial domain partitioning using a kd-tree...
متن کاملAlgorithmes sur GPU de visualisation et de calcul pour des maillages non-structurés
Most recent algorithms for Geometry Processing or Computational Fluid Dynamics (CFD) areusing new types of grids made of arbitrary polyhedra, in other words strongly unstructured grids. Incase of CFD simulations, these grids can be mapped with scalar or vector fields representing physicalproperties (for example : density, porosity, permeability).This thesis proposes new tools fo...
متن کاملTopology Preserving Isosurface Extraction for Geometry Processing
We address the problem of computing a topology preserving isosurface from a volumetric grid using Marching Cubes for geometry processing applications. We present a novel adaptive subdivision algorithm to generate a volumetric grid. Our algorithm ensures that every grid cell satisfies certain sampling criteria. We show that these sampling criteria are sufficient to ensure that the isosurface ext...
متن کاملProof of Correctness of a Marching Cubes Algorithm Carried out with Coq
The Marching Cubes algorithm is a well known and widely used approach for extracting a triangulated isosurface from a three-dimensional rectilinear grid of uniformly sampled data values. The algorithm relies on a large manually constructed table which exhaustively enumerates all possible patterns in which the isovalue relates to the values in the nodes of a cubical cell of the grid. For each pa...
متن کامل2 Accelerated Isosurface Extraction Approaches
The marching cubes [7,15] method demonstrated that isosurface extraction can be reduced, using a divide-and-conquer approach, to solving a local triangulation problem. In addition, the marching cubes method proposed a simple and efficient local triangulation using a lookup table. However, the marching cubes did not address the divide portion of the approach, i.e., how to efficiently search a la...
متن کامل